00_welcome_page
01_from_tree_to_graph
02_social_networks
03_road_maps_prerequisites
04_formal_definition
05_vertices_edges_degree
06_in_degree_out_degree
07_weighted_simple_graphs
08_core_graph_types
09_why_multiple_representations
10_edge_list_idea
11_edge_list_costs
12_adjacency_list_idea
13_adjacency_list_costs
14_adjacency_matrix_idea
15_adjacency_matrix_costs
16_directed_vs_undirected
17_where_to_store_weights
18_loops_and_parallel_edges
19_storage_and_operation_summary
20_build_a_graph_from_edge_list
21_add_remove_edge
22_test_adjacency
23_list_neighbors
24_compute_degrees
25_worked_example_u_the_grap
26_u_edge_list_adj_list
27_u_adjacency_matrix
28_example_d_digraph
29_d_across_representations
30_pitfall_indexing
31_pitfall_symmetry
32_pitfall_loops_parallel
33_choosing_representation
34_whats_next_bfs_dfs
35_recap_checklist
36_summary
> Terminal ready. Click 'Run Code' to execute your code.
Your Personal AI Tutor
Ask me anything! Here are some ideas to get started:
Understand Concepts
Ask me to explain the current slide or a concept in simple terms.
Generate Code
Request code examples in different programming languages.
Use Your Tone and Language
Ask in different languages or tones and I'll adapt.
The AI assistant can make mistakes, verify important info.